Explorer A polynomial time algorithm for computing extinction probabilities of multi - type branching processes
نویسندگان
چکیده
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open problems regarding the computational complexity of computing key quantities associated with some classic and well studied stochastic processes, including multi-type branching processes and stochastic context-free grammars.
منابع مشابه
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/ ), where > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) We use this result to resolve several open ...
متن کاملThe complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk)
In recent years, a considerable amount of research has been devoted to understanding the computational complexity of basic analysis problems, and model checking problems, for finitelypresented countable infinite-state probabilistic systems. In particular, we have studied recursive Markov chains (RMCs), recursive Markov decision processes (RMDPs) and recursive stochastic games (RSGs). These aris...
متن کاملPolynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic max (min) polynomial equations, referred to as maxPPSs (and minPPSs, respectively), in time polynomial in both the encoding size of the system of equations and in log(1/ǫ), where ǫ > 0 is the desired additive error bound of the solution. (The model of computation is the standard T...
متن کاملA strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
Multi-type branching processes (MBPs) are stochastic processes modeling populations in which the individuals of a generation produce a random number of children of different types or species in the next generation. Individuals can be elementary particles, genes, animals, or program threads [1,2]. MBPs are classified into subcritical, critical, and supercritical, depending on the spectral radius...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017